Maximizing Symmetric Submodular Functions
نویسندگان
چکیده
منابع مشابه
Maximizing Stochastic Monotone Submodular Functions
We study the problem of maximizing a stochastic monotone submodular function with respect to a matroid constraint. Our model can capture the effect of uncertainty in different problems, such as cascade effects in social networks, capital budgeting, sensor placement, etc. We study the adaptivity gap the ratio between the values of optimal adaptive and non-adaptive policies and show that it is eq...
متن کاملMaximizing submodular functions using probabilistic graphical models
We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available. In this paper, we propose a novel convex relaxation which is based on the relationship between submodular functions, entropies and probabilistic graphical models. In a graphical model, the entrop...
متن کاملMaximizing a class of submodular utility functions
Given a finite ground set N and a value vector a ∈ RN , we consider optimization problems involving maximization of a submodular set utility function of the form h(S) = f i∈S ai ) , S ⊆ N , where f is a strictly concave, increasing, differentiable function. This utility function appears frequently in combinatorial optimization problems whenmodeling risk aversion and decreasing marginal preferen...
متن کاملFPT Approximation Schemes for Maximizing Submodular Functions
We investigate the existence of approximation algorithms for maximization of submodular functions, that run in fixed parameter tractable (FPT) time. Given a non-decreasing submodular set function v : 2 → R the goal is to select a subset S of K elements from X such that v(S) is maximized. We identify three properties of set functions, referred to as p-separability properties, and we argue that m...
متن کاملFast algorithms for maximizing submodular functions
There has been much progress recently on improved approximations for problems involving submodular objective functions, and many interesting techniques have been developed. However, the resulting algorithms are often slow and impractical. In this paper we develop algorithms that match the best known approximation guarantees, but with significantly improved running times, for maximizing a monoto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2017
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3070685